A Practical and Secure Coercion-Resistant Scheme for Internet Voting
نویسندگان
چکیده
Juels, Catalano, and Jakobsson (JCJ) proposed at WPES 2005 the first voting scheme that considers real-world threats and that is more realistic for Internet elections. Their scheme, though, has a quadratic work factor and thereby is not efficient for large scale elections. Based on the work of JCJ, Smith proposed an efficient scheme that has a linear work factor. In this paper we first show that Smith’s scheme is insecure. Then we present a new coercion-resistant election scheme with a linear work factor that overcomes the flaw of Smith’s proposal. Our solution is based on the group signature scheme of Camenisch and Lysyanskaya (Crypto 2004).
منابع مشابه
A Receipt-free Coercion-resistant Remote Internet Voting Protocol without Physical Assumptions through Deniable Encryption and Trapdoor Commitment Scheme
The secure remote Internet voting protocol play an important role in Internet voting system. The direction of development of remote Internet voting protocol is that implementation of receipt-freeness and coercion-resistance is from with strong physical assumptions to with weak physical assumptions. The final purpose is that receiptfreeness and coercion-resistance is implemented without physical...
متن کاملTowards Practical and Secure Coercion-Resistant Electronic Elections
Coercion-resistance is the most effective property to fight coercive attacks in Internet elections. This notion was introduced by Juels, Catalano, and Jakobsson (JCJ) at WPES 2005 together with a voting protocol that satisfies such a stringent security requirement. Unfortunately, their scheme has a quadratic complexity (the overhead for tallying authorities is quadratic in the number of votes) ...
متن کاملScroll, Match & Vote: An E2E Coercion Resistant Mobile Voting System
Mobile Internet Elections are appealing for several reasons; they promise voter convenience, lower abstention rates and lower costs. However, there are a number of trust issues that prevent them from becoming ubiquitous, the most relevant of which is the possibility of coercion of the voter at the time of the vote. But other issues, like the trustworthiness of both the services running the elec...
متن کاملA practical and secure coercion-resistant scheme for remote elections
Juels, Catalano, and Jakobsson (JCJ) proposed at WPES 2005 the first scheme that considers real-world threats and that is more realistic for remote elections. Their scheme, though, has quadratic work factor and thereby is not efficient for large scale elections. Based on the work of JCJ, Smith proposed an efficient scheme that has linear work factor. In this paper we first show that the Smith’s...
متن کاملA Practical Coercion Resistant Voting Scheme Revisited
The scheme of ABRTY (Araújo et al., CANS 2010) is one of the most promising solutions for internet voting nowadays. It fights realistic coercive attacks and can be applied in large scale voting scenarios as it has linear time complexity. However, this scheme has two intrinsic drawbacks. As it does not allow revocation of credentials of ineligible voters, voters need to obtain fresh credentials ...
متن کامل